Exact Multiple Pattern Matching Algorithm using DNA Sequence and Pattern Pair
نویسندگان
چکیده
منابع مشابه
Exact Circular Pattern Matching Using the BNDM Algorithm
In this paper, we discuss a problem that performs searching a circular string on text from bitparallelism. Given a string X = x1x2 · · ·xm, a string X = xixi+1 · · ·xmx1 · · ·xi−1, for 1 ≤ i ≤ m, is a circular string of X. Given a text string T = t1t2 · · · tn and a pattern P , the circular pattern matching problem is to find all occurrences of P i in the text T . Our algorithm only uses the co...
متن کاملMultiple Skip Multiple Pattern Matching Algorithm (MSMPMA)
A new algorithm to search for multiple patterns simultaneously is proposed. The multiple pattern algorithms can be used in many applications that require such type of search and matching. For example, a multipattern matching can be used in lieu of indexing or sorting data in some applications that involve small to medium size datasets. One of its advantages is that no additional search structur...
متن کاملA Fast Multiple String-pattern Matching Algorithm
In this paper, we propose a simple but eecient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experime...
متن کاملImproved-Bidirectional Exact Pattern Matching
In this research, we present an improved version of Bidirectional (BD) exact pattern matching (EPM) algorithm to solve the problem of exact pattern matching. Improved-Bidirectional (IBD) exact pattern matching algorithm introduced a new idea of scanning partial text window (PTW) as well with the pattern to take decision of moving pattern to the right of partial text window. IBD algorithm compar...
متن کاملMultiple Keyword Pattern Matching using Position Encoded Pattern Lattices
Formal concept analysis is used as the basis for two new multiple keyword string pattern matching algorithms. The algorithms addressed are built upon a so-called position encoded pattern lattice (PEPL). The algorithms presented are in conceptual form only; no experimental results are given. The first algorithm to be presented is easily understood and relies directly on the PEPL for matching. It...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/2239-2862